Logspace computations for Garside groups of spindle type
نویسندگان
چکیده
M. Picantin introduced the notion of Garside groups of spindle type, generalizing the 3-strand braid group. We show that, for linear Garside groups of spindle type, a normal form and a solution to the conjugacy problem are logspace computable. For linear Garside groups of spindle type with homogenous presentation we compute a geodesic normal form in logspace.
منابع مشابه
Algorithms for Garside calculus
Garside calculus is the common mechanism that underlies a certain type of normal form for the elements of a monoid, a group, or a category. Originating from Garside’s approach to Artin’s braid groups, it has been extended to more and more general contexts, the latest one being that of categories and what are called Garside families. One of the benefits of this theory is to lead to algorithms so...
متن کاملLogspace Computations in Graph Groups and Coxeter Groups
Computing normal forms in groups (or monoids) is in general harder than solving the word problem (equality testing). However, normal form computation has a much wider range of applications. It is therefore interesting to investigate the complexity of computing normal forms for important classes of groups. We show that shortlex normal forms in graph groups and in right-angled Coxeter groups can ...
متن کاملParabolic subgroups of Garside groups
A Garside monoid is a cancellative monoid with a finite lattice generating set; a Garside group is the group of fractions of a Garside monoid. The family of Garside groups contains the Artin-Tits groups of spherical type. We generalise the well-known notion of a parabolic subgroup of an Artin-Tits group into that of a parabolic subgroup of a Garside group. We also define the more general notion...
متن کاملGaussian groups and Garside groups, two generalisations of Artin groups
It is known that a number of algebraic properties of the braid groups extend to arbitrary finite Coxeter type Artin groups. Here we show how to extend the results to more general groups that we call Garside groups. Define a Gaussian monoid to be a finitely generated cancellative monoid where the expressions of a given element have bounded lengths, and where left and right lower common multiples...
متن کاملLogspace computations in Coxeter groups and graph groups
Computing normal forms in groups (or monoids) is computationally harder than solving the word problem (equality testing), in general. However, normal form computation has a much wider range of applications. It is therefore interesting to investigate the complexity of computing normal forms for important classes of groups. For Coxeter groups we show that the following algorithmic tasks can be so...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1310.0933 شماره
صفحات -
تاریخ انتشار 2013